On Tensor-Factorisation Problems,I: The Combinatorial Problem
نویسندگان
چکیده
منابع مشابه
Generalised Coupled Tensor Factorisation
We derive algorithms for generalised tensor factorisation (GTF) by building upon the well-established theory of Generalised Linear Models. Our algorithms are general in the sense that we can compute arbitrary factorisations in a message passing framework, derived for a broad class of exponential family distributions including special cases such as Tweedie’s distributions corresponding to βdiver...
متن کاملLink Prediction via Generalized Coupled Tensor Factorisation
This study deals with the missing link prediction problem: the problem of predicting the existence of missing connections between entities of interest. We address link prediction using coupled analysis of relational datasets represented as heterogeneous data, i.e., datasets in the form of matrices and higher-order tensors. We propose to use an approach based on probabilistic interpretation of t...
متن کاملShifted 2D Non-negative Tensor Factorisation
Recently, Non-negative Matrix Factor 2D Deconvolution was developed as a means of separating harmonic instruments from single channel mixtures. This technique uses a model which is convolutive in both time and frequency, and so can capture instruments which have both time-varying spectra and timevarying fundamental frequencies simultaneously. However, in many cases two or more channels are avai...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملOn a Combinatorial Problem
Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2004
ISSN: 1461-1570
DOI: 10.1112/s1461157000001054